leanCoP: lean connection-based theorem proving

The Prolog program "prove(M,I) :append(Q,[C|R],M), \+member(-_,C), append(Q,R,S), prove([!],[[-!|C]|S],[],I). prove([],_,_,_). prove([L|C],M,P,I) :(-N=L; -L=N) -> (member(N,P); append(Q,[D|R],M), copy_term(D,E), append(A,[N|B],E), append(A,B,F), (D==E -> append(R,Q,S); length(P,K), K<I, append(R,[D|Q],S)), prove(F,S,[L|P],I)), prove(C,M,P,I)." implements a theorem prover for classical first-order (clausal) logic which is based on the connection calculus. It is sound, complete (if one more line is added), and demonstrates a comparatively strong performance.